A QP-Free Algorithm for Finite Minimax Problems
نویسندگان
چکیده
منابع مشابه
A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
In this paper we propose a new derivative-free algorithm for linearly constrained finite minimax problems. Due to the nonsmoothness of this class of problems, standard derivative-free algorithms can only locate points which satisfy weak necessary optimality conditions. In this work we define a new derivative-free algorithm which is globally convergent toward standard stationary points of the fi...
متن کاملA Simple SQP Algorithm for Constrained Finite Minimax Problems
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming. By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect. Furthermore, under some mild...
متن کاملDerivative-free optimization methods for finite minimax problems
Derivative-free optimization focuses on designing methods to solve optimization problems without the analytical knowledge of the function. In this paper we consider the problem of designing derivative-free methods for finite minimax problems: minx maxi=1,2,...N{fi(x)}. In order to solve the problem efficiently, we seek to exploit the smooth substructure within the problem. Using ideas developed...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملA globally convergent QP-free algorithm for nonlinear semidefinite programming
In this paper, we present a QP-free algorithm for nonlinear semidefinite programming. At each iteration, the search direction is yielded by solving two systems of linear equations with the same coefficient matrix; [Formula: see text] penalty function is used as merit function for line search, the step size is determined by Armijo type inexact line search. The global convergence of the proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/436415